Characterizing bounded orthogonally additive polynomials on vector lattices
نویسندگان
چکیده
منابع مشابه
Orthogonally Additive Polynomials on C*-algebras
Let A be a C*-algebra which has no quotient isomorphic to M2(C). We show that for every orthogonally additive scalar nhomogeneous polynomials P on A such that P is Strong* continuous on the closed unit ball of A, there exists φ in A∗ satisfying that P (x) = φ(x), for each element x in A. The vector valued analogue follows as a corollary.
متن کاملOrthogonally Additive Polynomials on Spaces of Continuous Functions
We show that, for every orthogonally additive homogeneous polynomial P on a space of continuous functions C(K) with values in a Banach space Y , there exists a linear operator S : C(K) −→ Y such that P (f) = S(f). This is the C(K) version of a related result of Sundaresam for polynomials on Lp spaces.
متن کاملAn equivalence functor between local vector lattices and vector lattices
We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...
متن کاملOn Equations in Bounded Lattices
The following properties of Boolean equations are well known: every system of equations is equivalent to a single equation of the form f(x1, . . . , xn) = 1, the consistency condition for such an equation, the method of successive elimination of variables, and the formula for the general (reproductive) solution using a particular solution. These features are shared by Post equations and by equa...
متن کاملOn Bounded Distance Decoding for General Lattices
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice L represented by some basis, and a target point y, nd the lattice point closest to y. Bounded Distance Decoding is a variant of this problem in which the target is guaranteed to be close to the lattice, relative to the minimum distance 1(L) of the lattice. Speci cally, in the -Bounded Distance ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archiv der Mathematik
سال: 2018
ISSN: 0003-889X,1420-8938
DOI: 10.1007/s00013-018-1251-4